Optimizing Non-Differentiable Metrics for Hashing
نویسندگان
چکیده
Image hashing embeds the image to binary codes which can boost efficiency of approximately nearest neighbors search. F-measure is a widely-used metric for evaluating performance methods. However, it non-differentiable and hence has not been used as an object function hashing. Heuristic algorithms, e.g. evolutionary computation particle swarm optimization (PSO), are good at optimizing objectives, while they inefficient in very high-dimensional variables commonly models. To address this contradict, we propose scheme bridge methods objective using PSO. The generate real-valued images then parameters quantization procedure optimized by Our incorporate wide range methods, heuristic algorithms metrics. Experimental results demonstrate that our be further improve existing
منابع مشابه
Optimizing Differentiable Relaxations of Coreference Evaluation Metrics
Coreference evaluation metrics are hard to optimize directly as they are nondifferentiable functions, not easily decomposable into elementary decisions. Consequently, most approaches optimize objectives only indirectly related to the end goal, resulting in suboptimal performance. Instead, we propose a differentiable relaxation that lends itself to gradient-based optimisation, thus bypassing the...
متن کاملQuantum estimation for non-differentiable models
State estimation is a classical problem in quantum information. In optimization of estimation scheme, to find a lower bound to the error of the estimator is a very important step. So far, all the proposed tractable lower bounds use derivative of density matrix. However, sometimes, we are interested in quantities with singularity, e.g. concurrence etc. In the paper, lower bounds to a Mean Square...
متن کاملRegularity Conditions for Non-Differentiable Infinite Programming Problems using Michel-Penot Subdifferential
In this paper we study optimization problems with infinite many inequality constraints on a Banach space where the objective function and the binding constraints are locally Lipschitz. Necessary optimality conditions and regularity conditions are given. Our approach are based on the Michel-Penot subdifferential.
متن کاملOn The Leibniz Rule And Fractional Derivative For Differentiable And Non-Differentiable Functions
In the recent paper Communications in Nonlinear Science and Numerical Simulation. Vol.18. No.11. (2013) 2945-2948, it was demonstrated that a violation of the Leibniz rule is a characteristic property of derivatives of non-integer orders. It was proved that all fractional derivatives Dα, which satisfy the Leibniz rule Dα(fg) = (Dαf) g+ f (Dαg), should have the integer order α = 1, i.e. fraction...
متن کاملAdversarial Variational Optimization of Non-Differentiable Simulators
Complex computer simulators are increasingly used across fields of science as generative models tying parameters of an underlying theory to experimental observations. Inference in this setup is often difficult, as simulators rarely admit a tractable density or likelihood function. We introduce Adversarial Variational Optimization (AVO), a likelihood-free inference algorithm for fitting a non-di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2021
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2021.3051190